Super link-connectivity of iterated line digraphs
نویسندگان
چکیده
Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Transmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs
Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.
متن کاملTransmission fault-tolerance of iterated line digraphs
Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.
متن کاملSuper Connectivity of Line Graphs and Digraphs
The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the connectivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1(L) = 2λ1(D), and that for a connected graph G and its line graph L, if one of κ1(L) and λ2(G) exists, then κ1...
متن کاملLine Directed Hypergraphs
In this article we generalize the concept of line digraphs to line dihypergraphs. We give some general properties in particular concerning connectivity parameters of dihypergraphs and their line dihypergraphs, like the fact that the arc connectivity of a line dihypergraph is greater than or equal to that of the original dihypergraph. Then we show that the De Bruijn and Kautz dihypergraphs (whic...
متن کاملRadii and centers in iterated line digraphs
We show that the out-radius and the radius grow linearly, or “almost” linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 1-3 شماره
صفحات -
تاریخ انتشار 2003